Nearest Neighbor Distances in an Infinite Entropic Point Pattern
نویسندگان
چکیده
منابع مشابه
Approximating Nearest Neighbor Distances
Several researchers proposed using non-Euclidean metrics on point sets in Euclidean space for clustering noisy data. Almost always, a distance function is desired that recognizes the closeness of the points in the same cluster, even if the Euclidean cluster diameter is large. Therefore, it is preferred to assign smaller costs to the paths that stay close to the input points. In this paper, we c...
متن کاملQuery Point Nearest Neighbor
We explore the eeect of dimensionality on the \nearest neigh-bor" problem. We show that under a broad set of conditions (much broader than independent and identically distributed dimensions), as di-mensionality increases, the distance to the nearest data point approaches the distance to the farthest data point. To provide a practical perspective , we present empirical results on both real and s...
متن کاملNearest neighbor pattern classification
The case of n unity-variance random variables x1, XZ,. * *, x, governed by the joint probability density w(xl, xz, * * * x,) is considered, where the density depends on the (normalized) cross-covariances pii = E[(xi jzi)(xi li)]. It is shown that the condition holds for an “arbitrary” function f(xl, x2, * * * , x,) of n variables if and only if the underlying density w(xl, XZ, * * * , x,) is th...
متن کاملRobotics Nearest Neighbor Interchange and Related Distances
More and more research effort has been done to study the non-cooperative games recently. Among these various forms of games, the unicast/multicast routing game [2,5,6] and multicast cost sharing game [1,3,4] have received a considerable amount of attentions over the past few year due to its application in the Internet. However, both unicast/multicast routing game and multicast cost sharing game...
متن کاملIKNN: Informative K-Nearest Neighbor Pattern Classification
The K-nearest neighbor (KNN) decision rule has been a ubiquitous classification tool with good scalability. Past experience has shown that the optimal choice of K depends upon the data, making it laborious to tune the parameter for different applications. We introduce a new metric that measures the informativeness of objects to be classified. When applied as a query-based distance metric to mea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geographical Analysis
سال: 2010
ISSN: 0016-7363
DOI: 10.1111/j.1538-4632.1977.tb00594.x